using the multiplicative schwarz alternating algorithm(msaa) for solving the large linear system of equations related to global gravity field recovery up to degree and order 120

the grace mission has substantiated the low–low satellite-to-satellite tracking (ll-sst) concept. the ll-sst configuration can be combined with the previously realized high–low sst concept in the champ mission to provide a much higher accuracy. the line of sight (los) acceleration difference between the grace satellite pair is the most frequently used observable for mapping the global gravity field of the earth in terms of spherical harmonic coefficients. the following relationship is valid for each evaluation point: (1) the grace ranging system provides inter-satellite range and its first time derivative, , as the ll-sst observations and the gps receivers mounted on the grace satellites provide the position vectors as the hl-sst mode observations. the inter-satellite range acceleration, , and are obtained by numerical differentiation of and , respectively. in the absence of non-gravitational forces, the left-hand side of eq. (1) can be considered as the los gravitational acceleration differences, (2) a sequence of observations with evaluation points sets up a system with linear equations. in this paper, the corresponding linear system of equations has been set up for spherical harmonic up to degree and order 120. the total number of unknowns, , is (3) such a linear equation system can be solved with iterative solvers or direct solvers. however, the runtime of direct methods or that of iterative solvers without a suitable preconditioner increases tremendously. this is the reason why we need a more sophisticated method to solve the linear system of problems with a large number of unknowns. multiplicative variant of the schwarsz alternating algorithm is a domain decomposition method, which allows it to split the normal matrix of the system into several smaller overlaped submatrices. in each iteration step the multiplicative variant of the schwarz alternating algorithm solves linear systems with the matrices obtained from the splitting successively. it reduces both runtime and memory requirements drastically. an msaa example with two submatrices is shown in fig. 1 figure 1. msaa example with two submatrices. this method dates back to h. a. achwarsz’ work, published in 1980, and has been investigated by many authors since then. in this paper we propose the multiplicative schwarz alternating algorithm (msaa) for solving the large linear system of gravity field recovery. the proposed algorithm has been applied in a close-loop simulation to the international association of geodesy (iag)-simulated data of the grace mission. the achieved results indicate the validity and efficiency of the proposed algorithm in solving the linear system of equations from accuracy and runtime points of view.